System and method for multicast transmission

ABSTRACT

A system and method for multicast transmission are disclosed. In one embodiment, a virtual exchange network including interconnected nodes is embedded within a network. A sender is disposed in communication with a root node and receivers are disposed in communication with a set of edge nodes. The sender publishes a packetized data stream to which the receivers subscribe. The packetized data stream is promulgated by implicit signaling through optimum virtual exchange network connections from the sender through the virtual exchange network to the receivers. The interconnected nodes, responsive to receiving the published packetized data stream, are adapted to multicast N instances of the published packetized data stream to N recipients selected from the group consisting of receivers and other of the interconnected nodes.

PRIORITY STATEMENT & CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of co-pending U.S. patent applicationSer. No. 12/047,281 entitled “System and Method for MulticastTransmission” and filed on Mar. 12, 2008 now U.S. Pat. No. 8,000,261 inthe names of Nimon et al.; which claims priority from U.S. PatentApplication No. 60/894,372, entitled “Virtual Exchange Network” andfiled on Mar. 12, 2007, in the names of Francis Dinha, Robert E. Nimon,and David E. Espenlaub; both of which are hereby incorporated byreference for all purposes.

TECHNICAL FIELD OF THE INVENTION

This invention relates, in general, to bulk data transfer applicationsand, in particular, to a system and method for multicast transmissionthat provides a virtual exchange network to enable the substantiallysimultaneous distribution of significant amounts of identical data from,for example, a single sender to multiple receivers.

BACKGROUND OF THE INVENTION

Most high-level network protocols, such as ISO Transport Protocols, TCP,or UDP, only provide unicast transmission services. That is, nodes ofthe network only have the ability to send to one other node at a time.This inherently point-to-point transmission service must performreplicated unicasts to send multiple copies of the transmission data inturn to each destination.

On the other hand, multicast transmission services provide an efficientway of disseminating data from a single sender to multiple receivers.Instead of sending a separate copy of the data to each individualrecipient, the sender just sends a single copy which is delivered to allof the receivers. Reliable, fault tolerant existing multicast solutions,however, utilize hardware level implementations which naturally restrictportability and limit the deployability of the multicast transmissionservices. These hardware level solutions, which include server-based androuter-based solutions, are not economically scalable and are difficultto administer for supporting multicast and broadcast applications. Thereis a significant need for a software-based solution that is simple touse and administer, economically scalable, portable over a wide varietyof operating environments, and designed with features to support broadcommunication services, enabling point-to-point, multicast, andbroadcast services.

SUMMARY OF THE INVENTION

A system and method for multicast transmission are disclosed. In oneembodiment, a Virtual Exchange Network (VXN) including interconnectednodes (VXN nodes) is embedded within a network. A sender is disposed incommunication with a root node and receivers are disposed incommunication with a set of edge nodes. The sender publishes apacketized data stream to which the receivers subscribe. The packetizeddata stream is propagated by implicit signaling through optimum virtualexchange network connections from the sender through the virtualexchange network to the receivers. Each of the interconnected nodes,responsive to receiving the published packetized data stream, is adaptedto multicast N instances of the published packetized data stream to Nrecipients which may include receivers and/or interconnected nodes.

The teachings presented herein enable existing networkinginfrastructures to multicast packetized data streams through anunlimited number of multicast points and to an unlimited number ofusers. No administrative overhead is required other than applicationcontrol of port allocation to set up large conference bridges, as themulticasting capabilities are dynamically configurable. Using a publishand subscription model furnishes wide flexibility and use of themulticast connections so that each receiver has the ability to select toreceive from any number of publishing senders, without any specialconfiguration or pre-administration steps.

The VXN and VXN nodes provide a simple and highly scalable solution forenabling point-to-point, multicast, and broadcast services that providefor realtime data exchange across a network such as the Internet,automatic failover recovery within the VXN, as well as flexible mediacommunication topologies to send, receive, unicast, multicast, andbroadcast data streams across any IP network. This avoids the need toadminister router capacity for conference sessions, for example, andother application while furnishing capacity for a large number of datastream receivers for broadcast applications.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the features and advantages of thepresent invention, reference is now made to the detailed description ofthe invention along with the accompanying figures in which correspondingnumerals in the different figures refer to corresponding parts and inwhich:

FIG. 1 is a block diagram of a network adapted for multicasttransmission according to embodiments presented herein;

FIG. 2 is a conceptual illustration of a multicast tree illustrating oneembodiment of a system for multicast transmission implemented forpoint-to-multipoint transmissions;

FIG. 3 is a conceptual illustration of another multicast treeillustrating another embodiment of a system for multicast transmissionimplemented for multipoint-to-multipoint transmissions;

FIG. 4 is a conceptual illustration of a further multicast treeillustrating a further embodiment of a system for multicast transmissionimplemented for multipoint-to-multipoint transmissions;

FIG. 5 is a conceptual illustration of the multicast tree of FIG. 2undergoing one embodiment of topology management;

FIG. 6 is a block diagram of one embodiment of the architecture of atopology server;

FIG. 7 is a block diagram of one embodiment of the layered architectureof a Virtual Exchange Network (VXN) node;

FIG. 8 is a block diagram of one embodiment of the layered architectureof senders and receivers;

FIGS. 9A and 9B are block diagrams of one embodiment of a VXN packetstructure; and

FIG. 10 is a flow chart of one embodiment of a method for multicasttransmission according to the teachings presented herein.

DETAILED DESCRIPTION OF THE INVENTION

While the making and using of various embodiments of the presentinvention are discussed in detail below, it should be appreciated thatthe present invention provides many applicable inventive concepts whichcan be embodied in a wide variety of specific contexts. The specificembodiments discussed herein are merely illustrative of specific ways tomake and use the invention, and do not delimit the scope of the presentinvention.

Referring initially to FIG. 1, therein is depicted a system formulticast transmission 10 implemented on a network 12 according toembodiments of the teachings presented herein. A virtual exchangenetwork (VXN) 14 for enabling reliable multicasts is embedded within thenetwork 12 and includes interconnected VXN nodes 1 through N, which arenumbered 16-1 through 16-N. Topology servers 18-1 through 18-N, whichform a topology server subsystem 20, are interconnected in peer-to-peerrelationships. It should be understood that the topology serversubsystem 20 may include only one topology server and redundancy mayform a portion of the topology server subsystem 20. Additionally, thetopology servers are disposed in communication with the VXN 14. Senders22-1 through 22-N are connected to the VXN 14 to publish content.Receivers 24-1 through 24-N are reciprocally connected to the VXN 14 tosubscribe to and receive the published content.

The VXN 14 multicasting provides an efficient way of disseminating datafrom the sender 22-1, for example, to a group of receivers 24-1 through24-N. Instead of sending a separate copy of the data to each individualreceiver 24, the sender 22-1 sends a single copy which is replicated toall of the receivers 24-1 through 24-N. The VXN 14 allows receivers tojoin VXN multicasts and exchange substantially realtime packetized datastreams across the network 12. As will be discussed in further detailhereinbelow, without any additional effort or transmissions from thesender 22-1, the VXN nodes 16-1 through 16-N act as multicast pointsthat permit any application to transmit packetized data streams to anyother VXN node 16-1 through 16-N and allow any receiver 24-1 through24-N to receive packetized data streams from any VXN node 16-1 through16-N. The VXN 14 thereby enables unique communication services that arenot possible with the existing IP networks.

The multicasting capabilities of VXN 14 provide for point-to-multipointand multipoint-to-multipoint multicasts including live content,in-progress content, and on-demand content. The multicast content mayrelate to different multicasting applications having, in general,different requirements. By way of example, a real-timemultipoint-to-multipoint multimedia multicasting application, such asnationwide video conferencing is enabled as is a point-to-multipointdata transfer application, such as the distribution of software orrecorded or in-progress live event content.

With respect to the in-progress content, the VXN 14 provides recordingcapabilities that permit recorded packetized data streams to betime-shifted. For example, a sender begins transmitting content at 8 PMand concludes at 9 PM. A receiver could receive this content live from 8PM or 9 PM. Additionally, the receiver may begin receiving the contentduring transmission. At 8:05 PM, for example, the receiver may beginreceiving the 8 PM content and be time-shifted by minus 5 minutes ordelayed 5 minutes during the multicast. Therefore, the multicast wouldend at 9:05 for this receiver. Moreover, the VXN 14 recordingcapabilities provide a receiver that joins an in-progress multicast withthe ability to navigate the multicast from the inception up to the liveportion and even join the live portion. Further, the capability toalternate between receiving a time-shifted multicast and a livemulticast is furnished. Following the completion of the multicast, theVXN 14 servers the receivers on-demand instances of the multicast asrequested.

FIG. 2 depicts a multicast tree illustrating one embodiment of thesystem 10 implemented for point-to-multipoint multicast transmissionsfrom sender 22-1 to receivers 24-1 through 24-11 via the VXN 14, whichincludes interconnected VXN nodes 16-1 through 16-11. It should beappreciated, however, that the VXN 14 may include any number andtopology of VXN nodes. The topology server subsystem 20 has completeknowledge of the VXN 14, which as depicted, is deployed in a multi-levelhierarchy of local zones 30-1 through 30-4. In one implementation, eachtopology server 18-1, 18-2 manages one or more of the local zones 30-1through 30-4. For example, the topology server 18-1 manages local zones30-1, 30-2 and the topology server 18-2 manages 30-3, 30-4. The topologyserver subsystem 20 collects information about the local state of eachof the VXN nodes 16-1 through 16-11 within its respective local zones30-1 through 30-4. The collected information includes usable portinterfaces and reachable neighbors, for example, and based on thisinformation the topology server subsystem 20 determines the path costsbetween each pair of VXN nodes 16-1 through 16-11.

Using an open shortest path first protocol, such as a Dijkstra-basedalgorithm, the topology server subsystem 20 generates a global multicasttopology map that includes the optimum VXN connection between any twoVXN nodes 16-1 through 16-11 acting as endpoint pairs, i.e., a root nodeto an edge node acting as a destination node. Of course, the globalmulticast topology map may support multiple paths of equal cost and, inone implementation, the next “hop address” are determined by choosingthe best eventual root-to-destination path. Further, the optimum VXNconnection may be determined based upon minimum cost path analysis,load, favorable conditions analysis, and other traffic managementfactors. The optimum VXN connection may be regularly re-optimized tosatisfy and adapt to dynamically changing network conditions. Thetopology server subsystem 20 utilizes the global multicast topology mapto build local multicast routing topology maps to populate each of theVXN nodes 16-1 through 16-11 and other network elements, such asrouters, that may be included in the VXN 14. Each of the local multicasttopology maps is a subset of the global multicast routing topology mapto provide information for a defined area of the VXN 14. For a givenrouter, for example, by providing the router with only a local multicasttopology map, global information is hidden to the router to enable anadditional level of routing protection and a reduction in routingprotocol traffic.

As illustrated, the sender 22-1 is disposed in communication with VXNnode 16-1, which is a root node. The sender 22-1 is publishingpacketized data streams as part of a multicast. This publication isassociated with a VXN address as well as an application assigned orarbitrarily assigned multicast name, in particular implementations. Inone embodiment, with the root VXN node 16-1 known, the topology serversubsystem 20 generates a global multicast routing topology map 32 andlocal multicast topology maps specific to the VXN address. The localmulticast topology maps are appropriately populated in the VXN 14.

Receivers 24-1 through 24-11 are disposed in communication with a set ofVXN nodes 16-2 through 16-4, 16-6 through 16-7, and 16-9 through 16-10.Receivers 24-1 through 24-11 are respectively subscribing to thepublished packetized data streams from the sender 22-1. With respect toreceiver 24-11 as an illustrative example, receiver 24-11 sends asubscription signal to VXN node 16-10. In one implementation of the VXN14 subscription model, implicit signaling is employed such that areceiver, such as receiver 24-11, can subscribe to a multicast address(and therefore the multicast) by sending a subscription signal having apacket to an edge VXN node, such as VXN node 16-10, over a providedoptimum VXN connection. The act of transmitting a packet to a VXNaddress implicitly causes the VXN 14 to subscribe the receiver to theVXN address associated with the multicast by the destination addressassociated with the subscription signal. In one configuration, areceiver may subscribe to a VXN address by sending a null packet (ofdata length=0) to the VXN address. This null packet is not propagated toother receivers. Rather the null packet subscribes the receiver to theVXN address denoted by the destination address of the sent null packet.

In response to receiving the subscription signal, VXN node 16-10associates receiver 24-11 with the VXN address assigned to the publishedpacketized data streams from the sender 22-1. In response to receivingthe published packetized data streams, the VXN node 16-10 will forwardthe published packetized data streams to the receiver 24-11. In oneembodiment, the VXN node 16-10 maintains a table with portinginformation identifying all receivers and other VXN nodes that aresubscribing to the particular VXN address.

Further, as the VXN node 16-10 has not subscribed to the packetized datastreams, the VXN node 16-10 sends a subscription signal, which may beconsidered a derivative of the original subscription signal fromreceiver 24-11, to VXN node 16-1, which is the root node. The VXN node16-1 will then forward the published packetized data streams to the VXNnode 16-10, which in turn, forwards the published packetized datastreams to receiver 24-11. For the portion of the multicast from thesender 22-1 to the receiver 24-11, the path from VXN node 16-1 to VXNnode 16-10 comprises an optimum VXN connection 34 where subscriptionsignals successively regressively traversed the optimum VXN connection34 in the form of subscription signals and derivative subscriptionsignals until the connection defined by the endpoints, i.e., the rootVXN node 16-1 and the edge VXN node 16-10, was realized. This optimumVXN connection 34 is included in the global multicast routing topologymap 32 stored at the topology server subsystem 20 and implemented withinthe VXN 14 by the local multicast routing topology maps.

With respect to the receiver 24-9 as a further illustrative example, thereceiver 24-9 sends a subscription signal to the VXN node 16-8, whichservers as the edge node to the receiver 24-9. In enabling thesubscription process, the VXN node 16-8 then sends a derivativesubscription signal to the VXN node 16-10 based on the content of thelocal multicast routing topology map installed therein. As the VXN node16-10 is already subscribing to the packetized data stream, the VXN node16-10 does not send a second subscription signal to the VXN node 16-1since, with respect to receiver 24-9, an optimum virtual exchangenetwork connection 36 between the endpoints of the VXN node 16-1 and theVXN node 16-8 is realized.

With respect to complete behavior of the VXN node 16-10, once thereceiver 24-10 is likewise subscribing to the packetized data stream,the VXN node 16-10 is a multicast point for the packetized data stream.Upon receiving an instance of the packetized data stream, the VXN node16-10 transmits three instances of the packetized data stream. Therecipients being receiver 24-11, the VXN node 16-9, and the VXN node16-8. More generally, each of the VXN nodes 16-1 through 16-11 areadapted as multicast points to multicast N instances of the receivedpublished packetized data stream to N recipients, which may includeother VXN nodes or receivers, for example.

The multicast capabilities of other VXN nodes that serve to create theglobal multicast routing topology map 32 are illustrated as well. Forexample, more than one receiver may subscribe to a particular VXN nodeas shown by receivers 24-3 through 24-5 being disposed in communicationwith the VXN node 16-4. Other types of VXN 14 behavior are exhibited bythe global multicast routing topology map 32. For example, VXN node16-5, which is part of the VXN 14, is disposed in close proximity to thereceiver 24-5, however VXN node 16-5 does not form a portion of theglobal multicast routing topology map 32 for the multicast by the sender22-1 assigned the aforementioned VXN address as the path costsassociated with the VXN node 16-5 are too high. In operation, themulticast capabilities and behaviors of the VXN nodes 16-1 through 16-11of the VXN 14 propagate the packetized data stream by implicit signalingthrough the optimum virtual exchange network connections according tothe local multicast routing topology maps.

FIG. 3 depicts one embodiment of a system for multicast transmissionimplemented for multipoint-to-multipoint transmissions. In thisembodiment, there are two senders, senders 22-1 and 22-2, which are alsoreceivers, receiver 24-12 and 24-3, respectively. The senders 22-1 and22-2 utilize the same root VXN node 16-1 and the packetized data streamsof the senders 22-1 and 22-2 have identical VXN addresses for purposesof propagating the packetized data streams. The VXN 14 behavior,otherwise, is the same as that presented and described in FIG. 2.

FIG. 4 depicts another embodiment of a system for multicast transmissionimplemented for multipoint-to-multipoint transmissions. In thisembodiment, two global multicast routing topology maps are generated;namely, one for each sender 22-1, 22-2. The packetized data streamsassociated with each sender 22-1, 22-2 are affiliated with separate VXNaddresses and the receivers 24-1 through 24-12 subscribe to each of themulticasts simultaneously. In this multipoint-to-multipoint, eachsender/receiver (22-1, 24-12); (22-2, 24-4) is a publishing entity andeach receiver including the sender/receivers 22-1, 24-12); (22-2, 24-4)listen to each publisher, other than themselves. As the size of amultipoint-to-multipoint multicast increases in scale, the number ofreceivers may far exceed the number of senders and the VXN 14 providesfor a smooth transition to these non-symmetric configurationsmaintaining the same efficient port usage and transparency to end userswithout any administrative effort.

The receiver selections can also be dynamically changed without anyimpact on the senders or the other listeners to the publishers. Throughthe use of additional VXN nodes to subscribe to the published packetizeddata stream, the number of potential receivers can readily be multipliedby layering multiple VXN nodes (Please see, for example, the layering ofVXN nodes 16-10, 16-8, 16-6, 16-7) to produce an audience of any size,including an audience in excess of millions of receivers. Thescalability of the VXN 14 therefore may range from unilateral orduplexed point-to-point communications to point-to-multipoint multicaststo multipoint-to-multipoint multicasts including broadcasts. Thelayering capability of the VXN nodes allows the VXN 14 to dynamicallyand seamlessly transition within this range of capabilities withoutadministrative intervention.

FIG. 5 depicts one embodiment of topology management as the VXN 14undergoes changes from a Time 1 to a Time 2. Specifically, the changesdepicted include a loss of a receiver, the addition of a receiver, and achange in the aggregate VXN node availability and/or associated pathcosts. From Time 1 to Time 2, the receiver 24-6 decides to endparticipation in the multicast. The receiver 24-6 sends a disconnectsignal to the VXN node 16-6, which then discontinues forwarding thepacketized data streams to the receiver 24-6. In another implementation,the receiver 24-6 disconnects implicitly by failing to send a requiredping or KEEP-ALIVE signal to the VXN node 16-6 or the topology serversubsystem 20, as designated by the particular VXN 14 configuration. Inthis implementation, the VXN node 16-6 or topology server subsystem 20,if appropriate, implies a disconnect condition by the failure to receivethe ping during a given length of time. In this instance, as the VXNnode 16-6 has no further receivers or VXN nodes subscribing to thepacketized data stream through the VXN node 16-6, the VXN node 16-6sends a disconnect signal to the VXN node 16-8. The VXN node 16-8, inturn, updates its internal table information and ceases sending the VXNnode 16-8 the packetized data stream.

The VXN 14 not only allows receivers to disconnect from the multicastsession at any time, the VXN 14 allows receivers to join at any timeduring an ongoing multicast session. From Time 1 to Time 2, a receiver24-13 joins the multicast by sending the VXN node 16-10, its closestrespective edge node, a subscription signal, which, in oneimplementation, is an empty packet. The VXN node 16-10, as it is alreadyreceiving and forwarding the packetized data stream, serves as amulticast point for both the receivers 24-10, 24-13.

Recovery from failures within the VXN nodal complex is automatic withthe VXN addressing scheme where both senders and receivers automaticallyreestablish communication paths periodically. Each data send operationpermits the VXN 14 to provide high reliability and a high quality userexperience in the presence of faults. By way of example, from Time 1 toTime 2, a fault occurs with the VXN node 16-3 to which the receiver 24-2is subscribing. Upon detecting this fault, the topology server subsystem20 generates a new global multicast routing topology map and associatedlocal multicast routing topology maps. In one embodiment, rather thanrepopulating the VXN 14 with local multicast routing topology maps, thetopology server subsystem 20 generates delta local multicast routingtopology maps which represent the differences, if any, between theprevious and new local multicast routing topology maps. The delta localmulticast routing topology maps are then propagated through the VXN 14and the network elements, whether VXNs or routers, utilize the deltalocal multicast routing topology maps to update the existing localmulticast routing topology maps. Returning to the example of receiver24-2, this updating occurs in realtime and the receiver 24-2 issubstantially instantaneously subscribed to the VXN node 16-4 tocontinue to participate in the multicast.

In one embodiment, there are three features in the VXN 14 whichindependently or together provide the functionality of allowing latejoining receivers to participate in the multicast; namely, the edge VXNnodes provide immediate subscription to the transmission as discussed,in-progress access, and on-demand access. Returning to receiver 24-13,when such a receiver subscribes to a transmission in progress, thereceiver may receive the live feed or the late joining receiver 24-13may access the in-progress multicast at any point from the inception ofthe multicast to the live feed. In this embodiment, the VXN node 16-9 isstoring the multicast and provides in-progress access. This storagecapability, which will be described in further detail hereinbelow,furnishes on-demand access to the multicast following completion. Itshould be understood that during a broadcast, the VXN 14 permits areceiver to alternate between the live access and in-progress access.

It should be appreciated that the embodiments described in FIGS. 1through 5 were presented as non-limiting working examples wherein thetopologies, number of senders, and number of receivers are solelyrepresentative of those which can be employed, and are not exhaustive ofthose available and operative. Other topologies and sender/receiverscalability are within the teachings of the present invention.

FIG. 6 depicts one embodiment of the architecture of the topology server18-1 which includes an engine 40 and multiple databases, a configurationdatabase 42, a topology database 44, and a cost analysis database 46.The topology server is located in communication with the VXN 14 and, forillustrative purposes, monitoring the connection between the VXN nodes16-11 and 16-4 which may be interconnected by several different pathsdefined between network elements 48 through 54, which are illustrated asrouters.

The topology server 18-1 has complete knowledge of the VXN nodes 16-11,16-4 and the associated interconnecting network elements 48 through 54.The topology of this portion of the VXN 14 is stored in the topologydatabase 44 as part of the global multicast routing topology. The engine40 uses this information to perform open shortest path firstcalculations using an algorithm such as the Dijkstra algorithm. Theoptimum. VXN connections that result from these calculations are storedin the cost analysis database 46. For example, the engine 40 determinesthat optimum VXN connection 56 from the VXN node 16-11 to the router 48to the router 52 to the VXN node 16-4 is the optimum path between theVXN node 16-11 and the VXN node 16-4. The local multicast routingtopology maps for the illustrated portion of the VXN 14 that providethis information to the VXN nodes 16-11, 16-4 and the network elements48, 52 are stored in the configuration database 42 for populating theVXN 14. Additionally, should any VXN topology change occur, the enginerecalculates the global multicast routing topology map, the optimum VXNconnections, the local multicast routing topology maps, as well as thedelta local multicast routing topology maps.

FIG. 7 depicts one embodiment of the layered architecture of a VXN node16-1 having an API 60 superposed on a transport layer 62, and a hardwarespace 64. The transport layer 62 responds to service requests from theAPI 60 and issues service requests to lower levels such as a networklayer. In the illustrated implementation, the transport layer 62includes one or more protocols and preferably a suite of protocols. Theillustrated protocols include RTCP, RAS, RTP, UDP, H.450.3, H.450.2,H.450.1, H.235, H.245, H.225, and TCP. It should be appreciated howeverthat the transport layer 62 may include any protocol or set ofprotocols.

A VXN stack 66 includes a channel manager 68, a VXN layer 70, a filesystem layer 72, a media layer 74, and a gateway layer 76. Thesecomponents of the VXN stack have access to a live database 80, anin-progress database 82, a lookup database 84, and VXN address tablesdatabase 86 which reside in the hardware space 64. In general, inresponse to receiving a packetized data stream 90 at the VXN layer 70,the channel manager 68 accesses the VXN address tables database 86 toidentify the number of subscribers subscribing this particular VXNaddressed multicast at VXN node 16-1. For each N subscribers, the VXNlayer 70 utilizes N multicast points 92 to replicate the packetized datastream 90 and simultaneously send N instances of the packetized datastream 90 to the N subscribers as indicated by the numeral 94. On theother hand, in an instance where the channel manager 68 is not yet asubscriber itself to the packetized data stream for which it receives asubscription request, the channel manager 68 may utilize a lookupdatabase to translate any received application assigned or arbitrarilyconstructed multicast name to the proper VXN address.

The file system layer 72 retains a copy of the packetized data stream 90and builds a file in the live database 80 of the live multicast. Themedia layer 74 builds an in-progress file in the in-progress database 82of the live multicast by repeatedly sampling the live database 80 orconcatenating, for example, the packetized data stream 90 onto theexisting file in the in-progress database 82. The in-progress file canbe rendered to provide a time-shifted multicast while the live multicastis in-progress. This in-progress file is distributed by a VXN node insuch a manner that the packetized data streams are transparently andseamlessly received by the receivers. The gateway layer translates theVXN packetized data stream 90 and in-progress file into anotherprotocol, such as HTTP or SIP to permit a receiver to receive thecontent with only the aid of a browser or other preexisting softwareapplication. Alternatively, the gateway layer translates the in-progressfile only into another protocol. The time-shifting capability providedby the VXN 14 and the databases 80, 82 allow for the recording of mediacontent while simultaneously serving earlier portions of the recordedcontent to interested receivers. In particular, this methodologyprovides for access to in-progress or time-shifted content while thelive multicast is continuing.

In one implementation, the VXN 14 and illustrated VXN node 16-1 utilizea flat addressing scheme, which may include a 64-bit addressing scheme.The VXN stack 66 and its enabled protocols are not implemented at the IPlevel. Rather, the VXN stack 66 is superposed on the transport layer 62as the VXN 14 enables a multicast network to be constructed out of VXNnodes 16-1 through 16-N that engage in unicast conversations between theindividual VXN nodes. In this architecture, the VXN 14 is implemented ontop of the existing unicast IP network. Moreover, with this addressingscheme, each of the interconnected nodes in the VXN 14 that is alignedwith the optimum virtual exchange network connections includes, for eachof the N recipients, a port address and recipient identity associatedwith the VXN address. This information being associated with VXN addresstables database 86 which resides in the hardware space 64.

As previously discussed, a ping message or a KEEP-ALIVE signal isperiodically transmitted by endpoints that are subscribers to aparticular multicast point, i.e., VXN node, to maintain the subscriptionin the active status. In one implementation, the KEEP-ALIVE signal isalso a SEND operation with no associated data for transmission, likethat which can be used to establish a subscription. This indicates thatthe subscription is active and the recipient is still able to receivedata. If the KEEP-ALIVE signal is not received within a specifiedtimeout interval (for example 30 seconds) then the endpoint isconsidered unsubscribed, and no data is sent to that endpoint after thattime, unless the subscription is established again.

With respect to disconnecting or unsubscribing from a multicast point,an endpoint, whether a VXN node or receiver, that wishes to stopreceiving data from a multicast point stops sending the KEEP-ALIVEpacket to the VXN Point. After the given timeout interval, the VXNmulticast point stops sending data to this particular endpoint. If anendpoint is unsubscribed, it must send an empty data packet to the VXNmulticast point in order to subscribe again. The same empty data packetused for subscription is also used for KEEP-ALIVE, thus if an endpointis unsubscribed because the KEEP-ALIVE signal is delayed, the nextKEEP-ALIVE signal that arrives is considered a subscription request, andthe endpoint is subscribed to the VXN multicast point once again.

FIG. 8 depicts one embodiment of the layered architecture of senders andreceivers. The sender/receiver (24-3, 22-2), the sender 22-1, and thereceiver 24-2 are each respectively connected to the VXN 14. Thesender/receiver (24-3, 22-2) includes a data transport layer 100, a datacontrol layer 102, and an application layer 104. With respect to thesending functionality of the sender/receiver (24-3, 22-2), an encoder106 digitizes and codes audio-video frames which are then forwarded to ademultiplexer 108 and divided into a number of channels 110 or streamsdepending on the type of protocol utilized. As illustrated, the streams110 are then transmitted through the VXN 14 as VXN packetized datastreams.

Prior to sending the packetized data streams, when the sender 24-3connects to one of the VXN nodes of the VXN 14 (selection of aparticular node is up to the application) using an operation, the sender24-3 is assigned a valid VXN address. Other receivers and VXN nodes cannow reference this application instance using this assigned VXN address.With respect to the receiver functionality of the sender/receiver (24-3,22-2), channels 112 or streams received from the VXN 14 at the datatransport layer 100 are combined at a multiplexer 114 and then decodedat decoder 116 for rendering to the sender/receiver (24-3, 22-2).

By way of another example, the sender 22-1 includes a similar datatransport layer 118, data control layer 120, application layer 122arrangement including channels 124, a demultiplexer 126, and an encoder128, respectively. Contrary to the sender/receiver (24-3, 22-2) andsender 22-1, the gateway functionality of the VXN nodes enables thereceiver 24-2 to receive HTTP streams rather than the VXN packetizeddata streams, thereby increasing the potential audience for the content.The receiver 24-2 also includes a data transport layer 130, a datacontrol layer 132, and an application layer 134. Channels 136 arereceived by the data transport layer 130 and multiplexed at multiplexer138 before being rendered by a browser 140.

FIGS. 9A and 9B depict one embodiment of a VXN packet structure 150which may be the aforementioned packetized data stream. With referenceto FIG. 9A, the VXN packet 150 includes a header 152 and a payload 154.As previously discussed, the VXN packet 150 is transmitted from a senderto a receiver through the VXN 14 implicitly without any new parametersbeing added to the existing signaling information elements of the VXNpacket 150. With reference to FIG. 9B, in one implementation, the header152 includes seven segments including a magic number segment 156, aprotocol version segment 158, a payload length segment 160, a packettype segment 162, a Time To Live (TTL) segment 164, a source segment166, and a destination segment 168. The following table, Table I: VXNPacket Segment Definitions, defines the VXN packet segments and table,Table II: VXN Packet Types, defines the VXN packet types.

TABLE I VXN Packet Segment Definitions Packet Segment Definition Magicnumber Hexadecimal Number Protocol version Version of VXN protocolPayload length Payload length, not including header Packet type PleaseSee Table II: VXN Packet Types TTL Decrementable value set by sender toprevent routing loops Source IP or other addressing information of thesender Destination VXN address

TABLE II VXN Packet Types Packet Type Definition 0 Unused - Reserved 1Data included to be forwarded 2 Unused - Reserved 3 Subscription request4 Response to subscription request 5 Ping message to keep connectionalive 6 Disconnect and terminate data flow - Adaptive topologymanagement 7 Resume data flow - Adaptive topology management

In one embodiment of a coded VXN packet 150, the following pseudocodepresented in Table III: VXN Packet Pseudocode may be employed.

TABLE III VXN Packet Pseudocode VXN packet structure struct vxn_header {uint8_t magic; /* magic number 0xBE */ uint8_t version; /* protocolversion */ uint16_t length; /* payload length, not including header */#define VH_MSG_UNDEF 0 #define VH_MSG_CLIENT 1 /* data packet to beforwarded */ /* 2 unused */ #define VH_MSG_REQUEST_ENDPOINT 3 /* Client−> Server endpoint address assignment request */ #define VH_MSG_ENDPOINT4 /* Server −> Client endpoint address assignment reply */ #defineVH_MSG_PING 5 /* Ping message */ #define VH_MSG_STANCH 6 /* Stop dataflow */ #define VH_MSG_RESUME 7 /* Resume data flow */ uint8_t type;uint8_t ttl; / * time-to-live -- discard packet if reaches 0 */ uint8_treserved1; uint8_t reserved2; vxn_endpoint_t src; /* source endpoint */mcast_t dest; /* destination endpoint }; */

It should be appreciated that the embodiments described in FIGS. 6through 9B were presented as non-limiting working examples wherein thecomponents, networked architectures, and protocols are solelyrepresentative of those which can be employed, and are not exhaustive ofthose available and operative. Other components, networkedarchitectures, and protocols are within the teachings of the presentinvention.

FIG. 10 depicts one embodiment of a method for multicast transmissionaccording to the teachings presented herein. At block 180, a virtualexchange network of interconnected nodes and network elements isestablished within the network. At block 182, the path cost betweenpairs of the interconnected nodes are determined by a topology serversubsystem in communication with the virtual exchange network. It shouldbe understood that the path cost calculations may include the optimumpath analysis described earlier. Based on these path costs, the topologyserver subsystem generates a global multicast routing topology map atblock 184. Then, at block 186, the global multicast routing topology mapis utilized by the topology server subsystem to generate local multicastrouting topology maps.

At block 188, these local multicast routing topology maps areappropriately distributed to the interconnected nodes and networkelements. At block 190, the sender of a packetized data stream isdisposed in communication with a root node, which is one of theinterconnected nodes of the VXN. At this step, the root node may receivethe packetized data stream published by the sender. Reciprocally, atblock 192, receivers disposed in communication with a set of edge nodes,which form a portion of the interconnected nodes, send subscriptionsignals to the respective edge nodes. At block 194, successivelyregressive derivative subscription signals are propagated through theoptimum virtual exchange network connections until the connectiondefined by a pair of endpoints is realized. For each of the receivers,the pair of endpoints are respectively the root node and one of the edgenodes. At block 196, the packetized data stream is transmitted byimplicit signaling through the optimum virtual exchange networkconnections from the sender to the plurality of receivers.

At block 198, the packetized data stream is stored for on-demand(post-publication) as well as in-progress access. At decision block 200,if the topology of the VXN has changed then the global multicasttopology routing map is recalculated at block 202. At this time thelocal multicast topology routing maps may be recalculated as well as thedelta local multicast topology routing maps. The delta local multicasttopology routing maps are propagated through the network as themethodology advances to block 204, wherein additional packetized datastreams are published. It the topology had not changed at decision block200, then the methodology would also have advanced to block 204. Fromblock 204, a return is made to block 196.

While this invention has been described with reference to illustrativeembodiments, this description is not intended to be construed in alimiting sense. Various modifications and combinations of theillustrative embodiments as well as other embodiments of the invention,will be apparent to persons skilled in the art upon reference to thedescription. It is, therefore, intended that the appended claimsencompass any such modifications or embodiments.

1. A system for multicast transmission of data over a network, thesystem comprising: a virtual exchange network embedded within thenetwork, the virtual exchange network including a plurality ofinterconnected nodes; a plurality of sender-receivers disposed incommunication with a set of edge nodes of the plurality ofinterconnected nodes, the plurality of sender-receivers for publishingrespective packetized data streams including virtual exchange networkaddresses, the plurality of sender-receivers for respectivelysubscribing to receive the published packetized data streams; a topologyserver subsystem disposed in communication with the virtual exchangenetwork, the topology server subsystem having complete knowledge of thevirtual exchange network; a global multicast routing topology mapgenerated by the topology server subsystem, the global multicast routingtopology map including a plurality of optimum virtual exchange networkconnections, each of the plurality of optimum virtual exchange networkconnections being defined by a pair of endpoints including at least twoof the edge nodes of the set of edge nodes; and a plurality of localmulticast routing topology maps generated by the topology server anddisposed along the plurality of optimum virtual exchange networkconnections, each of the plurality of local multicast routing topologymaps being a subset of the global multicast routing topology map toprovide routing information for a defined area of the virtual exchangenetwork, wherein the packetized data streams are propagated by implicitsignaling through the plurality of optimum virtual exchange networkconnections according to the plurality of local multicast routingtopology maps.
 2. The system as recited in claim 1, wherein each of theplurality of interconnected nodes, responsive to receiving an instanceof the published packetized data stream, is adapted to multicast Ninstances of the published packetized data stream to N recipientsselected from the group consisting of receivers and other of theinterconnected nodes.
 3. The system as recited in claim 2, wherein eachof the plurality of interconnected nodes aligned with the plurality ofoptimum virtual exchange network connections further comprises, for eachof the N recipients, a port address and recipient identity associatedwith the virtual exchange network address.
 4. The system as recited inclaim 1, wherein each of the plurality of interconnected nodes alignedwith the plurality of optimum virtual exchange network connectionssubscribes to receive the published packetized data streams successivelyregressively along each of the plurality of optimum virtual exchangenetwork connections from one of the set of edge nodes to another of theedge nodes.
 5. The system as recited in claim 1, wherein at least one ofthe edge nodes comprises a root node.
 6. The system as recited in claim1, wherein more than one of the plurality of sender-receivers subscribesto a particular one of the edge nodes.
 7. The system as recited in claim1, wherein the topology server subsystem comprises a plurality oftopology servers disposed in peer-to-peer contact.
 8. The system asrecited in claim 1, further comprising network elements forinterconnecting the plurality of interconnected nodes, the networkelements having the plurality of local multicast routing topology mapsdisposed therewith for routing the packetized data streams.
 9. Thesystem as recited in claim 1, wherein the topology server subsystemexecutes a Dijkstra-based algorithm to calculate path costs and buildthe global multicast topology routing map.
 10. The system as recited inclaim 1, wherein the topology server subsystem recalculates the globalmulticast topology routing map in response to a virtual exchange networktopology change.
 11. The system as recited in claim 10, wherein thevirtual exchange network topology change is selected from the groupconsisting of loss of a sender-receiver, addition of a sender-receiver,loss of a node, and addition of a node.
 12. A system for multicasttransmission of data over a network, the system comprising: a virtualexchange network embedded within the network, the virtual exchangenetwork including a plurality of interconnected nodes; a set of theplurality of interconnected nodes configured formultipoint-to-multipoint transmissions therebetween; a plurality ofoptimum virtual exchange network connections, included in a globalmulticast routing map generated by a topology server subsystem, each ofthe plurality of optimum virtual exchange network connections beingdefined by a pair of endpoints of a multipoint-to-multipointtransmission; a plurality of local multicast routing topology mapsgenerated by the topology service subsystem and disposed along theplurality of optimum virtual exchange network connections, each of theplurality of local multicast routing topology maps being a subset of theglobal multicast routing topology map to provide routing information fora defined area of the virtual exchange network; and a plurality ofsubscription signals respectively operably originating from the set,each of the plurality of subscription signals successively regressivelytraversing the optimum virtual exchange network connection of therespective set in the form of a derivative subscription signal until theconnection defined by the pair of endpoints is realized, wherein thepacketized data stream is propagated by implicit signaling through theplurality of optimum virtual exchange network connections according tothe plurality of local multicast routing topology maps.
 13. The systemas recited in claim 12, wherein each of the plurality of interconnectednodes, responsive to receiving an instance of the published packetizeddata stream, is adapted to multicast N instances of the publishedpacketized data stream to N recipients selected from the groupconsisting of receivers and other of the interconnected nodes.
 14. Thesystem as recited in claim 13, wherein each of the plurality ofinterconnected nodes aligned with the plurality of optimum virtualexchange network connections further comprises, for each of the Nrecipients, a port address and recipient identity associated with thevirtual exchange network address.
 15. The system as recited in claim 12,further comprising a topology server subsystem in communication with thevirtual exchange network, the topology server subsystem for executing aDijkstra-based algorithm to calculate path costs and determine theplurality of optimum virtual exchange network connections.
 16. A methodfor multicast transmission of data over a network, the methodcomprising: establishing a virtual exchange network of interconnectednodes and network elements within the network; determining the path costbetween pairs of the interconnected nodes at a topology server subsystemin communication with the virtual exchange network; generating, based onthe path costs between pairs of the interconnected nodes, at thetopology server subsystem a global multicast routing topology map thatincludes a plurality of optimum virtual exchange network connections,each of the plurality of optimum virtual exchange network connectionsbeing defined by a pair of endpoints; generating, based on the globalmulticast routing topology map, at the topology server subsystem aplurality of local multicast routing topology maps, each of theplurality of local multicast routing topology maps being a subset of theglobal multicast routing topology map to provide routing information fora defined area of the virtual exchange network; circulating theplurality of local multicast routing topology maps to the interconnectednodes and network elements; in response to a published packetized datastream and corresponding subscription signals, successively regressivelypropagating a plurality of derivative subscription signals through theoptimum virtual exchange network connections until the connectiondefined by the pair of endpoints is realized; and transmitting thepacketized data stream by implicit signaling through the plurality ofoptimum virtual exchange network connections.
 17. The method as recitedin claim 16, wherein determining the path cost between pairs of theinterconnected nodes further comprises executing a Dijkstra-basedalgorithm.
 18. The method as recited in claim 16, further comprisingrecalculating the global multicast topology routing map in response to avirtual exchange network topology change.
 19. The method as recited inclaim 16, further comprising recalculating the global multicast topologyrouting map in response to a virtual exchange network topology changeselected from the group consisting of loss of a receiver, addition of areceiver, loss of a node, and addition of a node.